Graph Classification Using Signal-Subgraphs: Applications in Statistical Connectomics
نویسندگان
چکیده
منابع مشابه
Fast Inexact Graph Matching with Applications in Statistical Connectomics
It is becoming increasingly popular to represent myriad and diverse data sets as graphs. When the labels of vertices of these graphs are unavailable, graph matching (GM)—the process of determining which permutation assigns vertices of one graph to those of another—is a computationally daunting problem. This work presents an inexact strategy for GM. Specifically, we frame GM as a quadratic assig...
متن کاملA new proposal for graph classification using frequent geometric subgraphs
Geometric graph mining has bees identified as a need in many applications. This technique detect patterns with some tolerance under a geometric transformation. To meet this need, some graph miners have been developed for detecting frequent geometric subgraphs. However, there are few works for applying this kind of geometric patterns as feature for classification tasks. In this paper, a new geom...
متن کاملEGG signal classification using statistical analysis
The method is used to register the laryngeal behavior indirectly by measuring change in the electrical impedance across the throat during speech or voice. In this Electroglottography (EGG) signal acquisition, the electrodes are made of steel. They have the form of rectangles covering an area of 10.75 cm 2 . It is designed as a ring electrode encircling each of the two other electrodes. The elec...
متن کاملClassification of encrypted traffic for applications based on statistical features
Traffic classification plays an important role in many aspects of network management such as identifying type of the transferred data, detection of malware applications, applying policies to restrict network accesses and so on. Basic methods in this field were using some obvious traffic features like port number and protocol type to classify the traffic type. However, recent changes in applicat...
متن کاملClassification of some strongly regular subgraphs of the McLaughlin graph
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, λ, μ) = (105, 32, 4, 12), (120, 42, 8, 18) and (176, 70, 18, 34) are unique upto isomorphism. Each of these graphs occurs as an induced subgraph in the strongly regular McLaughlin graph. We have used an orderly backtracking algorithm with look-ahead and look-back strategies, applying...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2013
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2012.235